HTPC: heterogeneous traffic-aware partition coding for random packet spraying in data center networks

Abstract Modern data center networks typically adopt multi-rooted tree topologies such leaf-spine and fat-tree to provide high bisection bandwidth. Load balancing is critical achieve low latency throughput. Although the per-packet schemes as Random Packet Spraying (RPS) can network utilization near-optimal tail in symmetric topologies, they are prone cause significant packet reordering degrade performance. Moreover, some coding-based proposed alleviate problem of loss. Unfortunately, these ignore traffic characteristics cannot good In this paper, we propose a Heterogeneous Traffic-aware Partition Coding named HTPC eliminate impact improve performance short long flows. smoothly adjusts number redundant packets based on multi-path congestion information so that tailing probability flows timeout be reduced. Through series large-scale NS2 simulations, demonstrate reduces average flow completion time by up 60% compared with state-of-the-art mechanisms.